Improving the convergence of non-interior point algorithms for nonlinear complementarity problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the convergence of non-interior point algorithms for nonlinear complementarity problems

Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm for solving the nonlinear complementarity problem. Their algorithm is globally convergent under a relatively mild condition. In this paper, we modify their algorithm and combine it with the superlinear convergence theo...

متن کامل

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems

Extending our previous work Monteiro and Pang (1996), this paper studies properties of two fundamental mappings associated with the family of interior-point methods for solving monotone nonlinear complementarity problems over the cone of symmetric positive semideenite matrices. The rst of these maps lead to a family of new continuous trajectories which include the central trajectory as a specia...

متن کامل

Two Interior-point Methods for Nonlinear P ( )-complementarity Problems

1 The authors would like to thank two anonymous referees for their helpful suggestions leading to a improved presentation of the paper. Abstract. Two interior-point algorithms using a wide neighborhood of the central path are proposed to solve nonlinear P-complementarity problems. The proof of the polynomial complexity of the rst method requires that the problem satisses a scaled Lipschitz cond...

متن کامل

A New Interior Point Algorithm for Nonlinear Complementarity Problems

1. Abstract The complementarity problem consists in finding x ∈ IR such that x ≥ 0 , F (x) ≥ 0 and xF (x) = 0, where F : IR → IR. Complementarity problems are involved in several applications in engineering, economy and different branches of physics . We mention contact problems and dynamics of multiple bodies systems in solid mechanics. In this paper we present a new feasible interior point al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-01082-0